The Learning of an Opponent's Approximate Preferences in Bilateral Automated Negotiation
نویسندگان
چکیده
Hamid Jazayeriy Masrah Azmi-Murad Nasir Sulaiman Nur Izura Udizir The Learning of an Opponent's Approximate Preferences in Bilateral Automated Negotiation Journal of Theoretical and Applied Electronic Commerce Research ISSN 0718–1876 Electronic Version VOL 6 / ISSUE 3 / DECEMBER 2011 / 65-84 © 2011 Universidad de Talca Chile This paper is available online at www.jtaer.com DOI: 10.4067/S0718-18762011000300006
منابع مشابه
Prediction of the Opponent's Preference in Bilateral Multi-issue Negotiation Through Bayesian Learning
In multi-issue negotiation, agents’ preferences are extremely important factors for reaching mutual beneficial agreements. However, agents would usually keeping their preferences in secret in order to avoid be exploited by their opponents during a negotiation. Thus, preference modelling has become an important research direction in the area of agent-based negotiation. In this paper, a bilateral...
متن کاملDemonstration of a Software System for Automated Multi-Attribute Negotiation
This paper presents the demonstration of a software system for integrative negotiation. The agents in this system conduct one-to-one negotiations, in which the values across multiple attributes are negotiated on simultaneously. It is demonstrated how the system supports both automated negotiation (i.e., conducted by a software agent) and human negotiation (where humans specify their bids). Furt...
متن کاملOn Learning Negotiation Strategies by Artificial Adaptive Agents in Environments of Incomplete Information
Automated negotiation by artificial adaptive agents (AAAs) holds great promise for electronic commerce, but non-trivial, practical issues remain. Published studies of AAA learning of negotiation strategies have been based on artificial environments that include complete payoff information for both sides of the bargaining table. This is not realistic in applied contexts. Without loss of generali...
متن کاملOpponent Modelling in Automated Multi-Issue Negotiation Using Bayesian Learning1
In bilateral negotiation, two parties aim at reaching a joint agreement. They do so by exchanging various offers or bids using e.g. an alternating offers protocol [2]. In reaching such an agreement both parties usually aim to satisfy their own interests as best as possible, but have to take their opponent’s preferences into account as well to reach an agreement at all. This is complicated by th...
متن کاملBLGAN: Bayesian Learning and Genetic Algorithm for Supporting Negotiation With Incomplete Information
Automated negotiation provides a means for resolving differences among interacting agents. For negotiation with complete information, this paper provides mathematical proofs to show that an agent's optimal strategy can be computed using its opponent's reserve price (RP) and deadline. The impetus of this work is using the synergy of Bayesian learning (BL) and genetic algorithm (GA) to determine ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JTAER
دوره 6 شماره
صفحات -
تاریخ انتشار 2011